Windowed backoff algorithms for WiFi: theory and performance under batched arrivals

Binary exponential backoff (BEB) is a decades -old algorithm for coordinating access to shared channel. In modern networks, BEB plays crucial role in WiFi and other wireless communication standards. Despite this track record, well-known theoretical results indicate that under bursty traffic, yields poor makespan, superior algorithms are possible. To date, the degree which these findings impact performance networks has not been examined. Here, we investigate challenging case BEB: single burst (batch) of packets simultaneously contend Using Network Simulator 3, incorporate into IEEE 802.11g several newer have theoretically-superior makespan guarantees. Surprisingly, discover underperform BEB. Investigating further, identify as culprit common abstraction regarding cost collisions. Our experimental complemented by analytical arguments number collisions—and solely makespan—is an important metric optimize. We propose new model accounts collisions, derive asymptotic bounds on align with our findings. Finally, argue implications design networks.